On the Total Curvature of Semialgebraic Graphs

نویسنده

  • LIVIU I. NICOLAESCU
چکیده

We define the total curvature of a semialgebraic graph Γ ⊂ R as an integral K(Γ) = R Γ dμ, where μ is a certain Borel measure completely determined by the local extrinsic geometry of Γ. We prove that it satisfies the Chern-Lashof inequality K(Γ) ≥ b(Γ), where b(Γ) = b0(Γ) + b1(Γ), and we completely characterize those graphs for which we have equality. We also prove the following unknottedness result: if Γ ⊂ R is homeomorphic to the suspension of an n-point set, and satisfies the inequality K(Γ) < 2 + b(Γ), then Γ is unknotted. Moreover, we describe a simple planar graph G such that for any ε > 0 there exists a knotted semialgebraic embedding Γ of G in R satisfying K(Γ) < ε+ b(Γ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows

Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the boundary of S is nonsingular and has positive curvature. In this paper, we generalize their result to unbounded sets, and also study the effect of the perspective transform on singularities.

متن کامل

On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

متن کامل

On the total version of geometric-arithmetic index

The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.

متن کامل

Further results on total mean cordial labeling of graphs

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008